Budan tables of real univariate polynomials

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Budan tables of real univariate polynomials

The Budan table of f collects the signs of the iterated derivatives of f . We revisit the classical Budan-Fourier theorem for a univariate real polynomial f and establish a new connectivity property of its Budan table. We use this property to characterize the virtual roots of f (introduced by Gonzalez-Vega, Lombardi, Mahé in 1998); they are continuous functions of the coefficients of f . We als...

متن کامل

Real roots of univariate polynomials and straight line programs

We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.

متن کامل

Zero sets of univariate polynomials

Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...

متن کامل

Zeros of univariate interval polynomials

Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros ...

متن کامل

Approximate Gcd of Inexact Univariate Polynomials

− The problem of finding the greatest common divisor (GCD) of univariate polynomials appears in many engineering fields. Despite its formulation is well-known, it is an ill-posed problem that entails numerous difficulties when the coefficients of the polynomials are not known with total accuracy, as, for example, when they come from measurement data. In this work we propose a novel GCD estimati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2013

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2012.11.004